Decompositions that destroy simple connectivity
نویسندگان
چکیده
منابع مشابه
Enzymes That Destroy Blood Group Specificity
An a-L-fucosidase was purified approximately 600-fold from Clostridium perfringens; it is free of other glycosidases present in the crude extract. The fucosidase occurs in multiple “isozymic” forms with molecular weights greater than 200,000. It is an oc-(1 + 2)-specific L-fucosidase with action on oligosaccharides and glycoproteins, but with no action on simple methyl or nitrophenyl fucosides....
متن کاملPermutations that Destroy Arithmetic Progressions in Elementary p-Groups
Given an abelian group G, it is natural to ask whether there exists a permutation π of G that “destroys” all nontrivial 3-term arithmetic progressions (APs), in the sense that π(b)− π(a) 6= π(c)− π(b) for every ordered triple (a, b, c) ∈ G3 satisfying b − a = c − b 6= 0. This question was resolved for infinite groups G by Hegarty, who showed that there exists an AP-destroying permutation of G i...
متن کاملThe splitting design that leads to simple random sampling
Implementing unequal probability sampling, without replacement, is very complex and several methods have been suggested for its performance, including : Midseno design and systematic design. One of the methods that have been introduced by Devil and Tille (1998) is the splitting design that leads to simple random sampling .in this paper by completely explaining the design, with an example, we ha...
متن کاملOn Compatible Star Decompositions of Simple Polygons
We introduce the notion of compatible star decompositions of simple polygons. In general, given two polygons with a correspondence between their vertices, two polygonal decompositions of the two polygons are said to be compatible if there exists a one-to-one mapping between them such that the corresponding pieces are defined by corresponding vertices. For compatible star decompositions, we also...
متن کاملSecond Order Subspace Analysis and Simple Decompositions
The recovery of the mixture of an N -dimensional signal generated by N independent processes is a well studied problem (see e.g. [1, 10]) and robust algorithms that solve this problem by Joint Diagonalization exist. While there is a lot of empirical evidence suggesting that these algorithms are also capable of solving the case where the source signals have block structure (apart from a final pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 1986
ISSN: 0019-2082
DOI: 10.1215/ijm/1256064229